On Modeling of Sorted Cost Consensus Negotiation Considering Efficiency and Time Based on the Stochastic Programming

In the consensus reaching process (CRP) permitting negotiation, efficiency of negotiation is affected by order with decision makers (DMs), time, and number moderators. this paper, sorted against DMs considering time initiated into making, which can improve speed effectiveness consensus. Based on opinion dynamics (opinion evolution), uniform normal distributions are used to describe uncertainty DMs’ opinions cost coefficient coined, cost-constrained optimal model involving multiple moderators constraints respectively constructed. The solution chance-constrained obtained in context China’s urban demolition using an improved genetic algorithm, optimum set influential individuals based similarity introduced so that assessment criteria for validating reasonableness sorting sequence determined. Sorted combined complex scenarios such as different representation formats opinions, characteristics DMs, other solving algorithms, Bayesian dynamics, etc. be included future works.